A new linearly constrained minimum variance beamformer for reconstructing EEG sparse sources

Brain source imaging based on EEG aims to reconstruct the neural activities producing the scalp potentials. This includes solving the forward and inverse problems. The aim of the inverse problem is to estimate the activity of the brain sources based on the measured data and leadfield matrix computed in the forward step. Spatial filtering, also known as beamforming, is an inverse method that reconstructs the time course of the source at a particular location by weighting and linearly combining the sensor data. In this paper, we considered a temporal assumption related to the time course of the source, namely sparsity, in the Linearly Constrained Minimum Variance (LCMV) beamformer. This assumption sounds reasonable since not all brain sources are active all the time such as epileptic spikes and also some experimental protocols such as electrical stimulations of a peripheral nerve can be sparse in time. Developing the sparse beamformer is done by incorporating L1-norm regularization of the beamformer output in the relevant cost function while obtaining the filter weights. We called this new beamformer SParse LCMV (SP-LCMV). We compared the performance of the SP-LCMV with that of LCMV for both superficial and deep sources with different amplitudes using synthetic EEG signals. Also, we compared them in localization and reconstruction of sources underlying electric median nerve stimulation. Results show that the proposed sparse beamformer can enhance reconstruction of sparse sources especially in the case of sources with high amplitude spikes.     

具有自动装卸搬运机器人的制造单元建模与分析

针对具有自动装卸搬运机器人的制造单元，着重考虑其双重资源约束的特点，提出了该系统的有限缓冲开排队网的建模方法。根据工件的加工、装卸与搬运等工艺流程，定义该系统的排队网模型的各种状态，基于连续时间马尔可夫链，采用精确解法对该模型进行分析求解，获得系统一系列的稳态性能指标。为了验证排队网建模方法的有效性，建立其对应的仿真模型，分别采用排队网模型的数值计算与仿真模型的仿真统计2种方法求出系统的性能指标进行对比，并基于排队网模型对该制造单元的系统性能进行分析，为该类制造单元的资源配置优化和设施布局优化等问题提供重要的理论支撑。     

Parameter estimation for a morphochemical reaction-diffusion model of electrochemical pattern formation

The process of electrodeposition can be described in terms of a reaction-diffusion partial differential equation (PDE) system that models the dynamics of the morphology profile and the chemical composition. Here we fit such a model to the different patterns present in a range of electrodeposited and electrochemically modified alloys using PDE constrained optimization. Experiments with simulated data show how the parameter space of the model can be divided into zones corresponding to the different physical patterns by examining the structure of an appropriate cost function. We then use real data to demonstrate how numerical optimization of the cost function can allow the model to fit the rich variety of patterns arising in experiments. The computational technique developed provides a potential tool for tuning experimental parameters to produce desired patterns.     

Multi-resource scheduling for FPGA systems

In modern cloud data centers, reconfigurable devices (FPGAs) are used as an alternative to Graphics Processing Units to accelerate data-intensive computations (e.g., machine learning, image and signal processing). Currently, FPGAs are configured to execute fixed workloads, repeatedly over long periods of time. This conflicts with the needs, proper to cloud computing, to flexibly allocate different workloads and to offer the use of physical devices to multiple users. This raises the need for novel, efficient FPGA scheduling algorithms that can decide execution orders close to the optimum in a short time. In this context, we propose a novel scheduling heuristic where groups of tasks that execute together are interposed by hardware reconfigurations. Our contribution is based on gathering tasks around a high-latency task that hides the latency of tasks, within the same group, that run in parallel and have shorter latencies. We evaluated our solution on a benchmark of 37500 random workloads, synthesized from realistic designs (i.e., topology, resource occupancy). For this testbench, on average, our heuristic produces optimum makespan solutions in 47.4% of the cases. It produces acceptable solutions for moderately constrained systems (i.e., the deadline falls within 10% of the optimum makespan) in 90.1% of the cases.     

Using a spectral scaling structured BFGS method for constrained nonlinear least squares

In this paper, we use a spectral scaled structured BFGS formula for approximating projected Hessian matrices in an exact penalty approach for solving constrained nonlinear least-squares problems. We show this spectral scaling formula has a good self-correcting property. The reported numerical results show that the use of the spectral scaling structured BFGS method outperforms the standard structured BFGS method.     

变分布的量子行为粒子群优化算法求解工程约束优化问题

针对工程形状设计领域中带有多个约束条件的非线性设计优化问题,提出了一种自适应的基于高斯分布的量子行为粒子群优化(AG-QPSO)算法。通过自适应地调整高斯分布,AG-QPSO算法能够在搜索的初始阶段有很强的全局搜索能力,随着搜索过程的进行,算法的局部搜索能力逐渐增强,从而满足了算法在搜索过程不同阶段的需要。为了验证算法的有效性,在压力容器和张弦设计问题这两个工程约束优化问题上进行50轮独立实验。实验结果表明,在满足所有约束条件的情况下,AG-QPSO算法在压力容器设计问题上取得了5890.9315的平均解和5885.3328的最优解,在张弦设计问题上取得了0.01096的平均解和0.01096的最优解,远优于标准粒子群优化(PSO)算法、具有量子行为的粒子群优化(QPSO)算法和高斯量子行为粒子群(G-QPSO)算法等现有的算法的结果,同时AG-QPSO算法取得的结果的方差较小,说明该算法具有很好的鲁棒性。     

基于等增量敏感性的高层建筑结构反向约束优化设计方法研究

以高层建筑结构为背景,提出了一种降级反向约束优化设计方法。降级反向约束优化设计方法根据工程设计习惯,按照整体、组件、构件、截面、构造的顺序逐级收紧设计约束条件,在每一轮设计中采用等增量敏感性分析方法,以最小的结构材料增量弥补本级冗余不足的设计准则,在满足规范安全性的同时,减少结构材料浪费。应用反向约束优化设计方法,对一个10层钢框架结构和一幢实际超高层钢结构进行了基于等增量敏感性的优化设计,并与正向约束优化设计方法的结果进行对比。研究结果表明,结构能够满足规范各项设计准则的要求,在充分满足安全性要求的同时,有效减少了结构材料用量,两个案例材料用料分别减少了14.2%和7.8%,且在优化过程中没有出现约束条件偏离限值的情况,提高了优化效率。     

可塑～坚硬状粘性土压缩模量在实际受荷压力段的取值探讨

根据粘性土室内侧限压缩试验曲线，理论上推导出地基土在实际受荷压力段的压缩模量当量值，并考虑原土结构性和有效应力损失等因素对该值进一步修正，得到可塑～坚硬状粘性土压缩模量比较合理的数值。